Acceleration by aggregation of successive approximation methods
نویسندگان
چکیده
منابع مشابه
Parsing by Successive Approximation
It is proposed to parse feature structure-based grammars in several steps. Each step is aimed to eliminate as many invalid analyses as possible as e ciently as possible. To this end the set of feature constraints is divided into three subsets, a set of context-free constraints, a set of ltering constraints and a set of structure-building constraints, which are solved in that order. The best pro...
متن کاملDeinterlacing by successive approximation
We propose an algorithm for deinterlacing of interlaced video sequences. It successively builds approximations to the deinterlaced sequence by weighting various interpolation methods. A particular example given here uses four interpolation methods, weighted according to the errors each one introduces. Due to weighting, it is an adaptive algorithm. It is also time-recursive, since the motion-com...
متن کاملSuccessive Approximation Methods in Undiscounted Stochastic Games
T HIS PAPER considers two-person, zero-sum stochastic games with finite state space = {1, -, N} and in each state i E 2, two finite sets K(i) and L(i) of actions available to player 1 and 2, respectively. The state of the system is observed at equidistant epochs. When the system is observed to be in state i, the two players choose an action, or a randomization of actions out of K(i) and L(i), r...
متن کاملSuccessive approximation methods for Markov games
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملAcceleration of Direct Model Optimization Methods by Function Approximation
In recent years optimization of simulation models has become a very important application field of direct optimization strategies. The searcn process of these iterative strategies is only based on cost function values and does not require any additional analytical information like gradients etc. Today the most common direct methods for global optimization are Genetic Algorithms, Evolution Strat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1982
ISSN: 0024-3795
DOI: 10.1016/0024-3795(82)90242-7